#include <bits/stdc++.h>
using namespace std;
int n;
vector<int> v;
int r[100005];
int ans;
int main(){
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    cin >> n;
    ans = n;
    for (int i = 1;i <= n;i++){
        int x;
        cin >> x;
        r[x]++;
        if (r[x] == 1){
            v.push_back(x);
        }
    }
    sort(v.begin(),v.end());
    for (int i = 0;i + 1 < v.size();i++){
         cout << i << " : " << v[i] << ' ' << r[v[i]] << endl;
        if (i != 0) r[v[i]] += r[v[i - 1]];
        ans -= min(r[v[i + 1]],r[v[i]]);
        r[v[i]] = max(0,r[v[i]] - r[v[i + 1]]);
    }
    cout << ans << endl;
    return 0;
}
